Business models for the Web: an analysis of top successful web sites

To investigate successful web business models, an original multidimensional framework is defined and applied to a large number of web sites. The framework‚ named BM*Web‚ combines issues already present in existing schema describing business models, with innovative aspects that have not previously been taken into account in those combinations or which are now viewed in a new light. Results of the application of BM*Web to the 500 top list of Alexa (at a speficic time) highlight an articulated picture where more than one success profile exists and not all of them include a web community, although a strong relationship exists between community and success under some conditions. The identification of features that characterize the most successful business models for the Web could be used to define guidelines for company management, once the appropriate profile for a company has been recognised.

Algorithms

Iterated function systems have been used extensively in the field of image compression and more recently are being used as a means of image representation. This document discusses theoretical work on the use of iterated function systems and genetic algorithms in a shape representation and recognition system. After a brief introduction a survey of some of the theory of iterated function systems and genetic algorithms is given. This is then followed by a description of existing work. The later part of the document discusses; an improvement to the adaptive plan used in the genetic algorithm; search space limitations; a qualitative model of genetic algorithms; the possibility of matching IFS encodings directly with those in a library of known encodings. 1 Introduction 1 2 Existing Approach 3 2.1 Iterated Function Systems : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 2.1.1 Attractor Rendering : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 2.2 Genetic Algorithms : : : ..

Or: Keeping LOLITA Busy

Abstract. In this paper we report on the ongoing parallelisation of LOLITA, a natural language engineering system. Although LOLITA currently exhibits only modest parallelism, we believe that it is the largest parallel functional program ever, comprising more than 47,000 lines of Haskell. LOLITA has the following interesting features common to real world applications of lazy languages:- the code was not specifically designed for parallelism;- laziness is essential for efficiency in LOLITA;- LOLITA interfaces to data structures outside the Haskell heap, usin